منابع مشابه
Fast Modular Transforms
It is shown that if division and multiplication in a Euclidean domain can be performed in O(N log ~ N) steps, then the residues of an N precision element in the domain can be computed in O(N log a+l N) steps. A special case of this result is that the residues of an N precision integer can be computed in O(N logS N log log N) total operations. Using a polynomial division algorithm due to Strasse...
متن کاملFast linear canonical transforms.
The linear canonical transform provides a mathematical model of paraxial propagation though quadratic phase systems. We review the literature on numerical approximation of this transform, including discretization, sampling, and fast algorithms, and identify key results. We then propose a frequency-division fast linear canonical transform algorithm comparable to the Sande-Tukey fast Fourier tran...
متن کاملFast Fourier Transforms
29 O(b log(b)) operations (using standard multiplication). As there are O(b= log(b)) primes in total, the running time of this stage of the algorithm is O(b 2 L), even using the \grammar school" method of integer multiplication. At this stage of the algorithm we have obtained a vector of length L whose entries are integral linear combinations of powers of with coeecients bounded by M in absolut...
متن کاملFast Hankel Transforms
JOHANSEN, H. K., and SORENSEN, K., 1979, Fast Hankel Transforms, Geophysical Prospecting 27, 876-901. Inspired by the linear filter method introduced by D. P. Ghosh in rg7o we have developed a general theory for numerical evaluation of integrals of the Hankel type: m g(r) = Sf(A)hJ,(Ar)dh; v > I. II Replacing the usual sine interpolating function by sinsh (x) = a . sin (xx)/sinh (UTW), where th...
متن کاملDimensionless Fast Fourier Transforms
This paper shows that there are fast Fourier transform (FFT) algorithms that work, for a fixed number of points, independent of the dimension. Changing the dimension is achieved by relabeling the input and the output and changing the “twiddle factors.” An important consequence of this result, is that a program designed to compute the 1-dimensional Fourier transform can be easily modified to com...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1974
ISSN: 0022-0000
DOI: 10.1016/s0022-0000(74)80029-2